NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
971	Towards Generation of High-performance Transformations Attila Vizhanyo, Aditya Agrawal, Feng Shi Institute for Software Integrated Systems, Vanderbilt University Nashville, TN 37235, USA {viza, aditya, fengshi }@isis.van Add to Reading List Source URL: www.isis.vanderbilt.edu Language: English - Date: 2008-06-17 14:04:56 Graph rewriting NP-complete problems Graph Subgraph isomorphism problem GrGen Graph theory Theoretical computer science Mathematics
972	Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm Tasuku Soma TASUKU SOMA @ MIST. I . U - TOKYO . AC . JP Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, 113- Add to Reading List Source URL: www.kmonos.net Language: English - Date: 2014-01-15 08:56:42 Order theory Submodular set function NP-complete problems Matroid theory Supermodular function Greedy algorithm Maximum coverage problem Approximation algorithm Static single assignment form Mathematics Mathematical analysis Mathematical optimization
973	Identifying cycle causes with CycleTable Jannik Laval, Simon Denier, St´ephane Ducasse RMoD Team, INRIA, Lille, France [removed] Abstract Add to Reading List Source URL: rmod.lille.inria.fr Language: English - Date: 2010-06-12 15:38:50 NP-complete problems Algebraic graph theory Graph theory Cycle graph Matroid theory
974	Microsoft Word - troubleshootingtcpipnetworks-h.doc Add to Reading List Source URL: www.wiresharkbook.com Language: English - Date: 2014-01-22 15:55:11 Mathematics NP-complete problems Graph coloring Matroid theory Graph theory Transmission Control Protocol Theoretical computer science
975	Carleton University Honours Project Knowledge in Rendezvous of Agents with Different Speeds Evan Huus [removed] Supervised by Professor E. Kranakis, Add to Reading List Source URL: dl.dropboxusercontent.com Language: English Game theory NP-complete problems Rendezvous problem Algorithm Graph coloring Adversary model Mathematics Theoretical computer science Applied mathematics
976	Microsoft Word - AvoidThatDejavuFeeling.doc Add to Reading List Source URL: agiledeveloper.com Language: English - Date: 2010-08-05 09:38:44 Combinatorial optimization NP-complete problems Applied mathematics Computational complexity theory Mathematics Design thinking Operations research Creativity Problem solving
977	Frequent Subgraph Discovery in Dynamic Networks Bianca Wackersreuther Peter Wackersreuther Annahita Oswald Add to Reading List Source URL: www.dbs.ifi.lmu.de Language: English - Date: 2010-08-16 05:10:29 Subgraph isomorphism problem Dense graph Graph coloring Rado graph Path decomposition Graph theory NP-complete problems Cograph
978	Defining lines of maximum probability for the design of patrol vessel itineraries Fernando Bação1 Victor Lobo2 1 ISEGI-UNL Add to Reading List Source URL: www.agile-online.org Language: English - Date: 2005-04-22 13:29:42 NP-complete problems Operations research Neural networks Dimension reduction Travelling salesman problem Self-organizing map SOM NP Theoretical computer science Computational complexity theory Applied mathematics
979	1 A Domain-Specific Language For Visualizing Software Dependencies as a Graph Alexandre Bergel1 , Sergio Maass1 , St´ephane Ducasse2 , Tudor Girba3 1 Add to Reading List Source URL: rmod.lille.inria.fr Language: English - Date: 2014-09-18 05:26:40 Graph drawing NP-complete problems Force-based algorithms Tree Graph Software visualization DOT language Social network analysis software Graph theory Mathematics Theoretical computer science
980	Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed] Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-12-03 20:27:51 Turing machine Models of computation Mathematical optimization Structural complexity theory Computational complexity theory NP P versus NP problem Reduction P-complete Theoretical computer science Applied mathematics Complexity classes

UPDATE